Cyclotomy and Duadic Codes of Prime Lengths

نویسندگان

  • Cunsheng Ding
  • Vera Pless
چکیده

In this paper we present a cyclotomic approach to the construction of all binary duadic codes of prime lengths. We calculate the number of all binary duadic codes for a given prime length and that of all duadic codes that are not quadratic residue codes. We give necessary and sufficient conditions for p such that all binary duadic codes of length p are quadratic residue (Q.R.) codes. We also show how to determine some weights of duadic codes with the help of cyclotomic numbers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Generalized Cyclotomy and Its Applications

In this paper we first introduce a new generalized cyclotomy of order 2 with respect to pe1 1 2pet t , then we calculate the new cyclotomic numbers of order 2. Some applications of the new cyclotomy in sequences, cryptography, and coding theory are also discussed. In the last section of this paper, we introduce more generalized cyclotomies and point out their applications. The major motivation ...

متن کامل

Computational Results of Duadic Double Circulant Codes

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called duadic double circulant codes, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual...

متن کامل

New MDS or near MDS self-dual codes over finite fields

The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain ...

متن کامل

Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime p, we determine the explicit complete weight enumerators of a family of linear codes over Fp with defining set related to cyclotomy. These codes may have applications in cryptography and secret sharing schemes. Index Terms Linear code, complete weight enumerator, cyclotomy, Gaussia...

متن کامل

Iso-orthogonality and Type-II duadic constacyclic codes

Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic constacyclic codes are isometrically orthogonal, and the duals of even-like duadic constacyclic codes are odd-like duadic constacyclic codes. We exhibit necessary and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1999